Combinatorial Bandits

We study sequential prediction problems in which, at each time instance, the forecaster chooses a vector from a given finite set S ⊆ R. At the same time, the opponent chooses a “loss” vector in R and the forecaster suffers a loss that is the inner product of the two vectors. The goal of the forecaster is to achieve that, in the long run, the accumulated loss is not much larger than that of the best possible element in S. We consider the “bandit” setting in which the forecaster only has access to the losses of the chosen vectors (i.e., the entire loss vectors are not observed). We introduce a variant of a strategy by Dani, Hayes, and Kakade achieving a regret bound that, for a variety of concrete choices of S, is of order √ nd ln |S| where n is the time horizon. This is not improvable in general and is better than previously known bounds. The examples we consider are all such that S ⊆ {0, 1}, and we show how the combinatorial structure of these classes can be exploited to improve the regret bounds. We also point out computationally efficient implementations for various interesting choices of S.